package 分类.回溯;

import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;

public class d递增子序列 {
    static List<List<Integer>> res=new LinkedList<>();
    static LinkedList<Integer> track=new LinkedList<>();
    public static List<List<Integer>> findSubsequences(int[] nums) {

        return res;
    }

    public static void printAllSub(char[] str, int i, String result) {
        if (i == str.length) {
            System.out.println(result);
            return;
        }
        printAllSub(str, i + 1, result);
        printAllSub(str, i + 1, result + str[i]);
    }


    public static void main(String[] args) {
        String nums="4117";
        char[] str=nums.toCharArray();
        printAllSub(str,0,"");
    }
}
